Research of network topological control algorithm in mWSN

نویسندگان

  • Xinlian Zhou
  • Jianbo Xu
چکیده

Relying on this paper presented clustering mobile wireless sensor model, we use the topological control of the combination of the clustering hierarchical structure and sleep scheduling mechanism. Firstly, present a inner-cluster node scheduling algorithm solution of inner-cluster connectivity coverage problem, which can meet user’s expected coverage scale and high-efficiency, avoiding the influence of mobile node location. This algorithm based on coverage analysis theory, deducts smallest mobile nodes number of user’s expected coverage scale φ , realizes innercluster nodes optimal scheduling, which only select k nodes with higher energy and nearer close to fixed node, others should be sleeping. Consequently realizes the schedule of higher energy nodes round sleeping, and better adapt to the mobility of inner-cluster nodes. Then, the whole network use TDMA to uniformly divide the time slots to avoid the interrupt of inter-cluster and inner-cluster communication. The slot scheduling makes the half of cluster realize parallel work, and cross-layer design. Simulation result display by this schedule, EDG (Efficient Data Gathering) decreases data delay, and largely relieves the burden of cluster-head, and has apparent energy-saving effect, and thinks about node’s mobility, can preferably suit to mobile wireless sensor network.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Cluster Head Selection Algorithm for Mobile Wireless Sensor Networks

Mobile Wireless Sensor Networks (MWSN) consists of nodes that are small sized and of mobile nature. Since nodes are mobile the energy drains out is continuous offering short duration networks and hence energy efficiency and network life time are still the major hurdles for efficient communication network. Literature indicates that Clustering is the most popular solution for energy efficient rou...

متن کامل

Ca-mwsn: Clustering Algorithm for Mobile Wireless Senor Network

This paper proposes a centralized algorithm for cluster-head-selection in a mobile wireless sensor network. Before execution of algorithm in each round, Base station runs centralized localization algorithm whereby sensors update their locations to base station and accordingly Base station performs dynamic clustering. Afterwards Base station runs CA-MWSN for cluster-head-selection. The proposed ...

متن کامل

A Cellular Automaton Based Algorithm for Mobile Sensor Gathering

In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...

متن کامل

Sampling from social networks’s graph based on topological properties and bee colony algorithm

In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...

متن کامل

A Clustering-Based K-Coverage Algorithm for Mobile Wireless Sensor Networks

To obtain more accurate and comprehensive information from target monitoring area in mobile wireless sensor networks (mWSN), multiple area coverage is often considered. However, it may cause coverage holes and inefficiencies in a mWSN due to sensor nodes' moving, energy loss, physical damage, errors, failures or other factors. To address this problem, a k-coverage algorithm for mobile wireless ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JNW

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2011